An Explicit Bound for Aliquot Cycles of Repdigits

نویسنده

  • Kevin A. Broughan
چکیده

We find an explicit bound, in terms of g when it is even, for the largest element of an aliquot cycle of repdigits to base g.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Aliquot Cycles of Repdigits

Here we show that the only aliquot cycle consisting only of rep-digits in base 10 is the cycle consisting of the perfect number 6. Generally, we show that if g is an even positive integer, then there are only finitely many aliquot cycles consisting entirely of repdigits in base g, which are, at least in principle, effectively computable.

متن کامل

Perfect repdigits

Here, we give an algorithm to detect all perfect repdigits in any base g > 1. As an application, we find all such examples when g ∈ [2, . . . , 333], extending a calculation from [2]. In particular, we demonstrate that there are no odd perfect repdigits for this range of bases. [2010]Primary 11A63, 11A05, 11A25

متن کامل

Amicable Pairs and Aliquot Cycles for Elliptic Curves over Number Fields

Let E/Q be an elliptic curve. Silverman and Stange define primes p and q to be an elliptic amicable pair if #E(Fp) = q and #E(Fq) = p. More generally, they define the notion of aliquot cycles for elliptic curves. Here we study the same notion in the case that the elliptic curve is defined over a number field K. We focus on proving the existence of an elliptic curve E/K with aliquot cycle (p1, ....

متن کامل

A generalization of zero-divisor graphs

In this paper, we introduce a family of graphs which is a generalization of zero-divisor graphs and compute an upper-bound for the diameter of such graphs. We also investigate their cycles and cores

متن کامل

Aliquot Cycles for Elliptic Curves with Complex Multiplication

We review the history of elliptic curves and show that it is possible to form a group law using the points on an elliptic curve over some field L. We review various methods for computing the order of this group when L is finite, including the complex multiplication method. We then define and examine the properties of elliptic pairs, lists, and cycles, which are related to the notions of amicabl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012